---
title: "L1-075 强迫症"
created: 2025-11-28
tags:
  - 算法
---

# L1-075 强迫症

## 题目 [L1-075 强迫症](https://pintia.cn/problem-sets/994805046380707840/exam/problems/type/7?problemSetProblemId=1386335159927652354&page=0)

![[image-96320341.png]]

## 思路分析

## 代码实现

```cpp
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
using ll = long long;
using ull = unsigned long long;
using PII = pair<int,int>;
using Pll = pair<ll,ll>;
int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
const int inf = 0x3f3f3f3f;

int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	string s;cin>>s;
	if(s.size()==4){
		string sl,sr;
		string ans;
		int tmp;
		for(int i=0;i<2;i++)
			sl+=s[i];
		tmp=stoi(sl);
		for(int i=2;i<4;i++)
			sr+=s[i];
		if(tmp<22)	ans="20"+sl+"-"+sr;
		else 	ans="19"+sl+"-"+sr;
		cout<<ans;
	}else if(s.size()==6){
		s.insert(4, "-");
		cout<<s;
	}
	return 0;
}
```

## 同类题型

## 视频讲解

---
⬅️ [[L1-074 两小时学完C语言|L1-074 两小时学完C语言]] 🏠 [[00-天梯赛]] ➡️ [[L1-076 降价提醒机器人|L1-076 降价提醒机器人]]